Shortest path problem - PDFSEARCH.IO - Document Search Engine

Shortest path problem
Results: 829

#	Item
481	An Hierarchical Terrain Representation for Approximately Shortest Paths David Mould and Michael C. Horsch Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada S7N 5A9 Add to Reading List Source URL: people.scs.carleton.ca Language: English - Date: 2008-08-15 17:38:04 Search algorithms Routing algorithms Game artificial intelligence Network theory Combinatorial optimization Shortest path problem Breadth-first search A* search algorithm Pathfinding Mathematics Theoretical computer science Graph theory
482	Lecture XIV Page 1 “The shortest path between two truths in the real domain passes through the complex domain.” Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:55:28 Operations research Routing algorithms Network flow NP-complete problems Bellman–Ford algorithm Shortest path problem Dynamic programming Flow network Tree Mathematics Theoretical computer science Graph theory
483	To be published at the International Semantic Web Conference (ISWC[removed]The framework will be available for download on November 5, 2010. Signal/Collect: Graph Algorithms for the (Semantic) Web Philip Stutz1 , Abraham Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-09-20 15:08:34 Graph coloring Shortest path problem Factor graph Algorithm Vertex Distance Floyd–Warshall algorithm Path decomposition Graph theory Mathematics Theoretical computer science
484	From: AAAI-93 Proceedings. Copyright © 1993, AAAI (www.aaai.org). All rights reserved. Planning Thomas Wit Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-09 21:10:32 Control theory Mathematical optimization Equations Reinforcement learning Automated planning and scheduling Anytime algorithm Algorithm Dynamic programming Shortest path problem Mathematics Operations research Applied mathematics
485	Space-efficient Local Computation Algorithms∗ Noga Alon† Ronitt Rubinfeld‡ Abstract Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2011-10-02 19:00:10 Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Graph coloring Decision tree model Probabilistic method Algorithm Shortest path problem Theoretical computer science Mathematics Applied mathematics
486	Journal of Artificial Intelligence Research[removed] Submitted 04/13; published[removed]Learning Optimal Bayesian Networks: A Shortest Path Perspective Add to Reading List Source URL: www.jair.org Language: English - Date: 2013-10-16 20:39:07 Bayesian statistics Statistical models Graphical models Game artificial intelligence Search algorithms Bayesian network A* search algorithm Shortest path problem Directed acyclic graph Graph theory Mathematics Applied mathematics
487	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics
488	Design Principles of Policy Languages ∗ for Path Vector Protocols Timothy G. Griffin AT&T Labs – Research Florham Park, NJ, USA Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:28 Physics Path vector protocol Border Gateway Protocol Routing Distance-vector routing protocol Open Shortest Path First Flow network Shortest path problem Norm Routing protocols Mathematics Network architecture
489	Probe Station Selection for Robust Network Monitoring Deepak Jeswani∗‡ , Nakul Korde∗‡ , Dinesh Patil∗‡ , Maitreya Natu‡ , John Augustine† ‡ Tata † School Add to Reading List Source URL: www.hipc.org Language: English - Date: 2009-11-13 17:38:42 Theoretical computer science Routing algorithms Routing Shortest path problem Routing and wavelength assignment Link-state routing protocol Mathematics Graph theory Network theory
490	Learning to Rank Typed Graph Walks: Local and Global Approaches Einat Minkov William W. Cohen Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-07-09 10:54:02 Network theory Algebraic graph theory Centrality Network analysis Networks Shortest path problem Connectivity Tree decomposition Power graph analysis Graph theory Mathematics Theoretical computer science

UPDATE